Strongly-Bounded Sparse Decompositions of Minor Free Graphs
نویسندگان
چکیده
As networks grow large and complex, a key approach in managing information and constructing algorithms is to decompose the network into locality-preserving clusters. Then, information and/or management can be divided between the clusters, such that every node is responsible only for clusters for which it belongs. Such decompositions into locality sensitive clusters have become key tools in network and graph theory and span a large body of literature. A key property of a useful decomposition is that each cluster has a short diameter. This property comes in two variants: a weak short diameter in which the short path between nodes may leave the common cluster and a strong diameter, in which each cluster has a small diameter when considered as an induced sub-graph. In this work we present sparse covers and sparse partitions with a bounded strong diameter for the family of minor-free graphs. The tools we present are useful in a large variety of distributed applications such as compact routing and synchronizers.
منابع مشابه
Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrary planar graph to index the decomposition. We prove that every graph that excludes a fixed graph as a minor has a planar decomposition with bounded width and a linear number of bags. The crossing number of a graph is ...
متن کاملComputing Bounded Path Decompositions in Logspace
The complexity of Graph Isomorphism (GI) is a long-standing open problem. GI is not known to be solvable in polynomial time and is unlikely to be NP-complete [BHZ87, Sch88]. Polynomial-time algorithms are known for GI of several special classes of graphs. One such interesting class is graphs excluding a fixed minor. Any family of graphs that is closed under taking minors falls into this class. ...
متن کاملThin graph classes and polynomial-time approximation schemes
Baker [1] devised a powerful technique to obtain approximation schemes for various problems restricted to planar graphs. Her technique can be directly extended to various other graph classes, among the most general ones the graphs avoiding a fixed apex graph as a minor. Further generalizations (e.g., to all proper minor closed graph classes) are known, but they use a combination of techniques a...
متن کاملKernelization Using Structural Parameters on Sparse Graph Classes
Meta-theorems for polynomial (linear) kernels have been the subject of intensive research in parameterized complexity. Heretofore, there were meta-theorems for linear kernels on graphs of bounded genus, H-minor-free graphs, and H-topological-minor-free graphs. To the best of our knowledge, there are no known meta-theorems for kernels for any of the larger sparse graph classes: graphs of bounded...
متن کاملAlgorithmic Properties of Sparse Digraphs
The notions of bounded expansion [49] and nowhere denseness [51], introduced by Nešetřil and Ossona de Mendez as structural measures for undirected graphs, have been applied very successfully in algorithmic graph theory. We study the corresponding notions of directed bounded expansion and nowhere crownfulness on directed graphs, as introduced by Kreutzer and Tazari in [41]. These classes are ve...
متن کامل